Parallel Resolution of the Satisfiability Problem: A Survey
نویسندگان
چکیده
The past few years have seen enormous progress in the performance of propositional satisfiability (SAT) solvers, and consequently SAT solvers are widely used in industry for many applications. In spite of this progress, there is strong demand for higher SAT algorithms efficiency to solve harder and larger problems. Unfortunately, most modern solvers are sequential and fewer are parallel. Our intention is to review the work of this last decade on parallel resolution of SAT with DPLL solvers which are the most widely used complete ones.
منابع مشابه
Algorithms for the satisfiability (SAT) problem: A survey
The satisfiability (SAT) problem is a core, problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, c...
متن کاملA New Decomposition Scheme for Parallel Resolution of the Satisfiability Problem (SAT)
A new Joining and model Checking scheme (JaCk-SAT) for parallel resolution of the SATisfiability problem is presented. The main goal of this methodology is to cut the variable-set in two subsets of about equal size. In contrast with recent propositions [12,16] for sequential resolution only, we do not use sophisticated hypergraph decomposition techniques such as Tree Decomposition that are very...
متن کاملEvaluation of the performance of parallel-hole collimator for high resolution small animal SPECT: A Monte Carlo study
Introduction: Image quality and accuracy of in vivo activity quantification in SPECT are affected by collimator penetration and scatter components, especially in high energy imaging. These phenomena highly depend on the collimator characteristic and photon energy. The presence of penetrated and scattered photons from collimator in SPECT images degrades spatial resolution, contr...
متن کاملResolution procedures for multiple-valued optimization
Signed clausal forms offer a suitable logical framework for automated reasoning in multiple-valued logics. It turns out that the satisfiability problem of any finitely-valued propositional logic, as well as of certain infinitely-valued logics, can be easily reduced, in polynomial time, to the satisfiability problem of signed clausal forms. On the other hand, signed clausal forms are a powerful ...
متن کاملAlgorithms for the Satisfiability ( Sat
The satissability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computer-aided design, computer-aided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007